Path integral quantization corresponding to the deformed Heisenberg algebra

In this paper, the deformation of the Heisenberg algebra, consistent with both the generalized uncertainty principle and doubly special relativity, has been analyzed. It has been observed that, though this algebra can give rise to fractional derivative terms in the corresponding quantum mechanical Hamiltonian, a formal meaning can be given to them by using the theory of harmonic extensions of function. Depending on this argument, the expression of the propagator of the path integral corresponding to the deformed Heisenberg algebra, has been obtained. In particular, the consistent expression of the one dimensional free particle propagator has been evaluated explicitly. With this propagator in hand, it has been shown that, even in free particle case, normal generalized uncertainty principle and doubly special relativity show very much different result.     

Volumetric path following algorithms for linear programming

We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n ^1/4 m ^1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n ² m), as opposed to O(nm ²), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.     

Uniformity in radon exhalation from construction materials using can technique

The uniformity in radon exhalation rates for 46 tiles of granite, marble and ceramic used as construction materials were determined using “Can Technique” employing CR-39 nuclear track detectors (NTDs). On each tile, two sealed cans, each enclosing one NTD fixed at the center of the tile surface area covered by the can, were mounted at two different locations of each individual tiles. The track production rates on the NTDs representing radon exhalation rates were measured. The radon exhalation rates from the surface of individual tiles showed uniform exhalations within the calculated uncertainties of the measured values. This makes Can Technique an alternative simple method to measure radon exhalation rates. Calibration required to convert track production rates into radon exhalation rates for the used can and NTD was done using an active technique. The correlation between the measurements by the two techniques shows a good linear correlation coefficient (0.83).     

有限维路代数的K_1群

本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群.     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.     

泛连通图定理和Ore2条件

记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2}，本得到：若n阶图G的Ore2≥n 1，则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。     

Semi-classical limit of the bottom of spectrum of a Schrödinger operator on a path space over a compact Riemannian manifold

We determine the limit of the bottom of spectrum of Schrödinger operators with variable coefficients on Wiener spaces and path spaces over finite-dimensional compact Riemannian manifolds in the semi-classical limit. These are extensions of the results in [S. Aida, Semiclassical limit of the lowest eigenvalue of a Schrödinger operator on a Wiener space, J. Funct. Anal. 203 (2) (2003) 401-424]. The problem on path spaces over Riemannian manifolds is considered as a problem on Wiener spaces by using Ito's map. However the coefficient operator is not a bounded linear operator and the dependence on the path is not continuous in the uniform convergence topology if the Riemannian curvature tensor on the underling manifold is not equal to 0. The difficulties are solved by using unitary transformations of the Schrödinger operators by approximate ground state functions and estimates in the rough path analysis.     

Standardization and certification in the area of environmentally degradable plastics

Environmentally degradable polymers and plastics (EDPs) are a group of polymeric materials experiencing a rapid growth in number as well as in their applications and quantities used. The assessment of their key characteristic - degradability, including eventually biodegradability as the ultimate stage, is scientifically and technically a challenging issue and has led to differing interpretations in the past. In order to standardize techniques and criteria a number of standards were established by different standardization bodies which are also used as a basis for certification schemes. An up-to-date inventory of the rapidly growing standardization body is presented with basic interpretation to help guide the non-expert. A basic introduction to EDPs and polymer degradation is added for clarity.     

Elucidating dominant factors of PO43-, Cd2+ and nitrobenzene removal by biochar: A comparative investigation based on distinguishable biochars

Four distinct biochars were employed to remove three typical pollutants, meanwhile, path analysis, a multi-statistical regression method, was performed to elucidate the dominant factors of biochar adsorption. This work can provide a new insight to prepare a targeted biochar as adsorbents.